The Influence of Lookahead in Competitive Paging Algorithms (Extended Abstract)
نویسنده
چکیده
Efficient Self Simulation Algorithms for Reconfigurable Arrays p. 25 Optimal Upward Planarity Testing of Single-Source Digraphs p. 37 On Bufferless Routing of Variable-Length Messages in Leveled Networks p. 49 Saving Comparisons in the Crochemore-Perrin String Matching Algorithm p. 61 Unambiguity of Extended Regular Expressions in SGML Document Grammars p. 73 On the Direct Sum Conjecture in the Straight Line Model p. 85 Combine and Conquer: a General Technique for Dynamic Algorithms p. 97 Optimal CREW-PRAM Algorithms for Direct Dominance Problems p. 109 Trekking in the Alps Without Freezing or Getting Tired p. 121 Dog Bites Postman: Point Location in the Moving Voronoi Diagram and Related Problems p. 133
منابع مشابه
The influence of lookahead in competitive on-line algorithms
In the competitive analysis of on-line problems, an on-line algorithm is presented with a sequence of requests to be served. The on-line algorithm must satisfy each request without the knowledge of any future requests. We consider the question of lookahead in on-line problems: What improvement can be achieved in terms of competitiveness, if the on-line algorithm sees not only the present reques...
متن کاملOn Competitive On-Line Paging with Lookahead
This paper studies two methods for improving the competitive efficiency of on-line paging algorithms: in the first, the on-line algorithm can use more pages; in the second, it is allowed to have a lookahead, or in other words, some partial knowledge of the future. The paper considers a new measure for the lookahead size as well as Young’s resource-bounded lookahead and proves that both measures...
متن کاملAlternatives to competitive analysis
Competitive analysis allows us to make strong theoretical statements about the performance of an algorithm without making probabilistic assumptions on the inputs. However, it has been often criticized with respect to its realism. A wide range of online algorithms –both good and not so good in practice– seem to have the same competitive ratio. A concrete example of this is the inability of compe...
متن کاملOnline Scheduling with Lookahead: Multipass Assembly Lines
This paper describes our use of competitive analysis and the on-line model of computation in a product development setting; speciically, we use competitive analysis to evaluate on-line scheduling strategies for controlling a new generation of networked reprographic machines (combination printer-copier-fax machines servicing a network) currently being developed by companies such as Xerox Corpora...
متن کاملBeyond Competitive Analysis
The competitive analysis of online algorithms has been criticized as being too crude and unrealistic. We propose refinements of competitive analysis in two directions: The first restricts the power of the adversary by allowing only certain input distributions, while the other allows for comparisons between information regimes for online decision-making. We illustrate the first with an applicati...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1993